Auflistung nach Schlagwort "Theorem proving"

Sortiert nach: Sortierung: Ergebnisse:

  • On the number of iterations required by von Neumann addition 
    Grübel, Rudolf; Reimers, Anke (Cambridge : Cambridge University Press, 2001)
    We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based ...
  • Triangle density and contractibility 
    Kriesell, Matthias (Cambridge : Cambridge University Press, 2005)
    Let G be a noncomplete k -connected graph such that the graphs obtained from contracting any edge in G are not k-connected, and let t(G) denote the number of triangles in G. Thomassen proved t(G) ≥ 1, which was later ...